Sparse Coding Algorithm with Negentropy and Weighted ℓ1-Norm for Signal Reconstruction
نویسندگان
چکیده
منابع مشابه
Sparse Coding Algorithm with Negentropy and Weighted ℓ1-Norm for Signal Reconstruction
Compressive sensing theory has attracted widespread attention in recent years and sparse signal reconstruction has been widely used in signal processing and communication. This paper addresses the problem of sparse signal recovery especially with non-Gaussian noise. The main contribution of this paper is the proposal of an algorithm where the negentropy and reweighted schemes represent the core...
متن کاملSparse signal reconstruction from limited data using FOCUSS: a re-weighted minimum norm algorithm
We present a nonparametric algorithm for finding localized energy solutions from limited data. The problem we address is underdetermined, and no prior knowledge of the shape of the region on which the solution is nonzero is assumed. Termed the FOcal Underdetermined System Solver (FOCUSS), the algorithm has two integral parts: a low-resolution initial estimate of the real signal and the iteratio...
متن کاملSparse Signal Reconstruction from Limited Data Using FOCUSS: A Re-weighted Minimum Norm Algorithm - Signal Processing, IEEE Transactions on
We present a nonparametric algorithm for finding localized energy solutions from limited data. The problem we address is underdetermined, and no prior knowledge of the shape of the region on which the solution is nonzero is assumed. Termed the FOcal Underdetermined System Solver (FOCUSS), the algorithm has two integral parts: a low-resolution initial estimate of the real signal and the iteratio...
متن کاملA Study on Sparse Signal Reconstruction from Interlaced Samples by l1-Norm Minimization
We propose a sparse signal reconstruction algorithm from interlaced samples with unknown offset parameters based on the l1-norm minimization principle. A typical application of the problem is superresolution from multiple lowresolution images. The algorithm first minimizes the l1norm of a vector that satisfies data constraint with the offset parameters fixed. Second, the minimum value is furthe...
متن کاملBayesian L1-Norm Sparse Learning
We propose a Bayesian framework for learning the optimal regularization parameter in the L1-norm penalized least-mean-square (LMS) problem, also known as LASSO [1] or basis pursuit [2]. The setting of the regularization parameter is critical for deriving a correct solution. In most existing methods, the scalar regularization parameter is often determined in a heuristic manner; in contrast, our ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Entropy
سال: 2017
ISSN: 1099-4300
DOI: 10.3390/e19110599